0.00/0.00	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : supatvars_ext
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --sup-at-vars \
0.00/0.00	  --restrict-hidden-sup-at-vars \
0.00/0.00	  --ho-ext-axiom \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n046.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 17:13:26 CST 2018
0.00/0.21	% done 13 iterations in 0.005s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff(upairsubunion, axiom,
0.00/0.21	  (upairsubunion <=>
0.00/0.21	   (![A,B,Xx]:
0.00/0.21	      (in(Xx,A) =>
0.00/0.21	       (![Xy]:
0.00/0.21	          (in(Xy,B) =>
0.00/0.21	           subset(setadjoin(Xx,setadjoin(Xy,emptyset)),binunion(A,B)))))))).
0.00/0.21	tff('0', plain,
0.00/0.21	    ![X2, X3, X4, X5]:
0.00/0.21	      (~ in(X2, X3)
0.00/0.21	       | subset(setadjoin(X2, setadjoin(X4, emptyset)), binunion(X3, X5))
0.00/0.21	       | ~ in(X4, X5)
0.00/0.21	       | ~ upairsubunion),
0.00/0.21	    inference('cnf', [status(esa)], [upairsubunion])).
0.00/0.21	tff(upairinpowunion, conjecture,
0.00/0.21	  (powersetI1 =>
0.00/0.21	   (upairsubunion =>
0.00/0.21	    (![A,B,Xx]:
0.00/0.21	       (in(Xx,A) =>
0.00/0.21	        (![Xy]:
0.00/0.21	           (in(Xy,B) =>
0.00/0.21	            in(setadjoin(Xx,setadjoin(Xy,emptyset)),powerset(binunion(A,B)))))))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (powersetI1 =>
0.00/0.21	     (upairsubunion =>
0.00/0.21	      (![A,B,Xx]:
0.00/0.21	         (in(Xx,A) =>
0.00/0.21	          (![Xy]:
0.00/0.21	             (in(Xy,B) =>
0.00/0.21	              in(setadjoin(Xx,setadjoin(Xy,emptyset)),powerset(binunion(A,B))))))))))).
0.00/0.21	tff('1', plain, upairsubunion, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('2', plain,
0.00/0.21	    ![X2, X3, X4, X5]:
0.00/0.21	      (~ in(X2, X3)
0.00/0.21	       | subset(setadjoin(X2, setadjoin(X4, emptyset)), binunion(X3, X5))
0.00/0.21	       | ~ in(X4, X5)
0.00/0.21	       | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.21	tff('3', plain,
0.00/0.21	    ![X2, X3, X4, X5]:
0.00/0.21	      (~ in(X4, X5)
0.00/0.21	       | subset(setadjoin(X2, setadjoin(X4, emptyset)), binunion(X3, X5))
0.00/0.21	       | ~ in(X2, X3)),
0.00/0.21	    inference('simplify', [status(thm)], ['2'])).
0.00/0.21	tff(powersetI1, axiom,
0.00/0.21	  (powersetI1 <=> (![A,B]: (subset(B,A) => in(B,powerset(A)))))).
0.00/0.21	tff('4', plain,
0.00/0.21	    ![X0, X1]: (~ subset(X0, X1) | in(X0, powerset(X1)) | ~ powersetI1),
0.00/0.21	    inference('cnf', [status(esa)], [powersetI1])).
0.00/0.21	tff('5', plain, powersetI1, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('6', plain,
0.00/0.21	    ![X0, X1]: (~ subset(X0, X1) | in(X0, powerset(X1)) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['4', '5'])).
0.00/0.21	tff('7', plain, ![X0, X1]: (in(X0, powerset(X1)) | ~ subset(X0, X1)),
0.00/0.21	    inference('simplify', [status(thm)], ['6'])).
0.00/0.21	tff('8', plain,
0.00/0.21	    ~ in(setadjoin(sk_Xx1, setadjoin(sk_Xy1, emptyset)), 
0.00/0.21	        powerset(binunion(sk_A2, sk_B2))),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('9', plain,
0.00/0.21	    (~ $true
0.00/0.21	     | ~ subset(setadjoin(sk_Xx1, setadjoin(sk_Xy1, emptyset)), 
0.00/0.21	           binunion(sk_A2, sk_B2))),
0.00/0.21	    inference('sup-', [status(thm)], ['7', '8'])).
0.00/0.21	tff('10', plain,
0.00/0.21	    ~ subset(setadjoin(sk_Xx1, setadjoin(sk_Xy1, emptyset)), 
0.00/0.21	        binunion(sk_A2, sk_B2)),
0.00/0.21	    inference('simplify', [status(thm)], ['9'])).
0.00/0.21	tff('11', plain, (~ $true | ~ in(sk_Xx1, sk_A2) | ~ in(sk_Xy1, sk_B2)),
0.00/0.21	    inference('sup-', [status(thm)], ['3', '10'])).
0.00/0.21	tff('12', plain, in(sk_Xx1, sk_A2),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('13', plain, in(sk_Xy1, sk_B2),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('14', plain, (~ $true | ~ $true | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['11', '12', '13'])).
0.00/0.21	tff('15', plain, $false, inference('simplify', [status(thm)], ['14'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
